public class Demofs11 {
    BinaryTree.TreeNode find(BinaryTree.TreeNode root, char val) {
        if(root==null){
            return null;
        }
        if(root.val==val){
            return root;
        }
        BinaryTree.TreeNode ret1 = find(root.left,val);
        if(ret1 != null){
            return ret1;
        }
        BinaryTree.TreeNode ret2 = find(root.right.right,val);
        if(ret2 != null){
            return ret2;
        }
        return null;
    }
}
